Concentration for self-bounding functions and an inequality of Talagrand
نویسندگان
چکیده
We see that the entropy method yields strong concentration results for general selfbounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 29, 549–557, 2006
منابع مشابه
Entropy-Based Concentration Inequalities for Dependent Variables
We provide new concentration inequalities for functions of dependent variables. The work extends that of Janson (2004), which proposes concentration inequalities using a combination of the Laplace transform and the idea of fractional graph coloring, as well as many works that derive concentration inequalities using the entropy method (see, e.g., (Boucheron et al., 2003)). We give inequalities f...
متن کاملOn concentration of self-bounding functions
We prove some new concentration inequalities for self-bounding functions using the entropy method. As an application, we recover Talagrand’s convex distance inequality. The new Bernstein-like inequalities for self-bounding functions are derived thanks to a careful analysis of the so-called Herbst argument. The latter involves comparison results between solutions of differential inequalities tha...
متن کاملConcentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal travelling salesmen tours, Steiner trees and the eigenvalues of random symmetric matrices. 1 Introduction Since its appearance in 1995 Talagrands convex distance inequali...
متن کاملA note on Talagrand’s convex hull concentration inequality
The paper reexamines an argument by Talagrand that leads to a remarkable exponential tail bound for the concentration of probability near a set. The main novelty is the replacement of a mysterious calculus inequality by an application of Jensen’s inequality.
متن کاملThe convex distance inequality for dependent random variables, with applications to the stochastic travelling salesman and other problems
We prove concentration inequalities for general functions of weakly dependent random variables satisfying the Dobrushin condition. In particular, we show Talagrand’s convex distance inequality for this type of dependence. We apply our bounds to a version of the stochastic salesman problem, the Steiner tree problem, the total magnetisation of the Curie-Weiss model with external field, and expone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 29 شماره
صفحات -
تاریخ انتشار 2006